Deterministic Application of Grover's Quantum Search Algorithm
نویسندگان
چکیده
Grover’s quantum search algorithm finds one of t solutions in N candidates by using (π/4) √ N/t basic steps. It is, however, necessary to know the number t of solutions in advance for using the Grover’s algorithm directly. On the other hand, Boyer etal proposed a randomized application of Grover’s algorithm, which runs, on average, in O( √ N/t) basic steps (more precisely, (9/4) √ N/t steps) without knowing t in advance. Here we show a simple (almost trivial) deterministic application of Grover’s algorithm also works and finds a solution in O( √ N/t) basic steps (more precisely, (8π/3) √ N/t steps) on average.
منابع مشابه
A Lecture on Grover's Quantum Search Algorithm Version 1.1
This paper ia a written version of a one hour lecture given on Lov Grover's quantum database search algorithm. It is based on [4], [5], and [9].
متن کاملCan Quantum Computers Be Useful When There
Formulation of the problem. Quantum computers (see, e.g., 5]) have a potential of speeding up computations in many important problems. For example: By using Grover's algorithm 3, 4], for any given error probability e 0 , we can search for an item in an n-item (un-sorted) database in (p n) steps (where checking that a given element is the desired one is counted as a single step). By contrast, th...
متن کاملO ct 2 00 0 A LECTURE ON GROVER ’ S QUANTUM SEARCH ALGORITHM VERSION 1 . 0
This paper ia a written version of a one hour lecture given on Luv Grover's quantum database search algorithm. It is based on [4], [5], and [9].
متن کاملReasoning about Grover ’ s Quantum Search
MICHAEL BUTLER and PIETER HARTEL Department of Electronics & Computer Science University of Southampton Southampton SO17 1BJ United Kingdom {mjb,phh}@ecs.soton.ac.uk Grover's search algorithm is designed to be executed on a quantum-mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides...
متن کاملAdaptive Phase Matching in Grover's Algorithm
When the Grover’s algorithm is applied to search an unordered database, the successful probability usually decreases with the increase of marked items. In order to solve this problem, an adaptive phase matching is proposed. With application of the new phase matching, when the fraction of marked items is greater 3 5 8 , the successful probability is equal to 1 with at most two Grover itera...
متن کامل